The recognition of k-EPT graphs
نویسندگان
چکیده
We consider a generalization of edge intersection graphs of paths in a tree. Let P be a collection of nontrivial simple paths in a tree T . We define the k-edge (k ≥ 1) intersection graph Γk(P), whose vertices correspond to the members of P, and two vertices are joined by an edge if the corresponding members of P share k edges in T . An undirected graph G is called a k-edge intersection graph of paths in a tree, and denoted by k-EPT, if G = Γk(P) for some P and T . It is known that the recognition and the coloring of the 1-EPT graphs are NP-complete. We extend this result and prove that the recognition and the coloring of the k-EPT graphs are NP-complete for any fixed k ≥ 1. We show that the problem of finding the largest clique on k-EPT graphs is polynomial, as was the case for 1-EPT graphs. We prove that the family of 1-EPT graphs is contained in, but not equal to, the family of k-EPT graphs for any fixed k ≥ 2. We also investigate the hierarchical relationships between related classes of graphs, and present an infinite family of graphs that are not k-EPT graphs for every k ≥ 2. The edge intersection graphs are used in network applications. Scheduling undirected calls in a tree is equivalent to coloring an edge intersection graph of paths in a tree. Also assigning wavelengths to virtual connections in an optical network is equivalent to coloring an edge intersection graph of paths in a tree.
منابع مشابه
The k-edge intersection graphs of paths in a tree
We consider a generalization of edge intersection graphs of paths in a tree. Let P be a collection of nontrivial simple paths in a tree T . We define the k-edge (k 1) intersection graph k(P), whose vertices correspond to the members of P, and two vertices are joined by an edge if the corresponding members ofP share k edges in T . An undirected graphG is called a k-edge intersection graph of pat...
متن کاملTriangulated edge intersection graphs of paths in a tree
Let T = (V(T), E(T)) be a tree and B = {Pi} denote a collection of non-trivial (i.e., of length at least 1) simple paths in T, where a path P= (v,, u2, . . . , Q) is considered in the sequel as the collection {{uJ, {Q}, . . . ,{z)J, {u,, u2}, {u2, I+}, _ . . , {w,-,, Q}}. The intersection graph 0(S, 9) of 9 over set S has vertices which correspond to the paths in 9 and two vertices uk and U! ar...
متن کاملHelly $\mathbf{EPT}$ graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition
The edge intersection graph of a family of paths in host tree is called an EPT graph. When the host tree has maximum degree h, we say that G belongs to the class [h, 2, 2]. If, in addition, the family of paths satisfies the Helly property, then G ∈ Helly [h, 2, 2]. The time complexity of the recognition of the classes [h, 2, 2] inside the class EPT is open for every h > 4. In [6], Golumbic et a...
متن کاملEdge and vertex intersection of paths in a tree
In this paper we continue the investigation of the class of edge intersection graphs of a collection of paths in a tree (EPT graphs) where two paths edge intersect if they share an edge. The class of EPT graphs differs from the class known as path graphs, the latter being the class of vertex intersection graphs of paths in a tree. A characterization is presented here showing when a path graph i...
متن کاملGraphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II
Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P , and EPT(P) is the EPT graph (i.e. the edge intersection graph) of P . These graphs have been extensively studied in the literature. Given two (edge) intersecting paths in a graph, their split vertices is the set of vertices having degree at least 3 in their u...
متن کامل